A note on tight cuts in matching-covered graphs

نویسندگان

چکیده

Edmonds, Lov\'asz, and Pulleyblank showed that if a matching covered graph has nontrivial tight cut, then it also ELP-cut. Carvalho et al. gave stronger conjecture: cut $C$, ELP-cut does not cross $C$. Chen, al proof of the conjecture. This note is inspired by paper We give simplified conjecture, prove following result which slightly than $C$ $G$ an ELP-cut, there sequence $G_1=G, G_2,\ldots,G_r, r\geq2$ graphs, such for $i=1, 2,\ldots, r-1$, $G_i$ $C_i$, $G_{i+1}$ $C_i$-contraction $G_i$, $2$-separation $G_r$.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on minimal matching covered graphs

A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.

متن کامل

On Perfect Matchings in Matching Covered Graphs

Let G be a matching-covered graph, i.e., every edge is contained in a perfect matching. An edge subsetX ofG is feasible if there exists two perfect matchingsM1 andM2 such that |M1∩X| 6≡ |M2∩X| (mod 2). Lukot’ka and Rollová proved that an edge subset X of a regular bipartite graph is not feasible if and only if X is switching-equivalent to ∅, and they further ask whether a non-feasible set of a ...

متن کامل

On Generalizations of Matching-covered Graphs

Structural results for extensions of matching-covered graphs are presented in this paper.

متن کامل

A note on vague graphs

In this paper, we introduce the notions of product vague graph, balanced product vague graph, irregularity and total irregularity of any irregular vague graphs and some results are presented. Also, density and balanced irregular vague graphs are discussed and some of their properties are established. Finally we give an application of vague digraphs.

متن کامل

Ear-decompositions of matching covered graphs

We call a graph matching-covered if every line belongs to a perfect matching. We study the technique of "ear-decompositions" of such graphs. We prove that a non-bipartite matchingcovered graph contains K~ or K2@Ka (the triangular prism). Using this result, we give new characterizations of those graphs whose matching and covering numbers are equal. We apply these results to the theory of r-criti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics & Theoretical Computer Science

سال: 2021

ISSN: ['1365-8050', '1462-7264']

DOI: https://doi.org/10.46298/dmtcs.6013